0.04/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.13	% Command    : run_vampire %s %d THM
0.13/0.34	% Computer : n028.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 1440
0.13/0.34	% WCLimit    : 180
0.13/0.34	% DateTime   : Thu Jul  4 07:49:24 EDT 2024
0.13/0.34	% CPUTime    : 
0.13/0.36	This is a THF_ problem
0.13/0.36	Running higher-order theorem proving
0.22/0.37	Running /export/starexec/sandbox/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox/tmp/tmp.2hQaHFxudp/E---3.1_22706.p -m 16384 -t 180
0.22/0.39	% (22946)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on E---3.1_22706 for (1799ds/4Mi)
0.22/0.39	% (22947)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on E---3.1_22706 for (1799ds/27Mi)
0.22/0.39	% (22949)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on E---3.1_22706 for (1799ds/2Mi)
0.22/0.39	% (22948)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on E---3.1_22706 for (1799ds/2Mi)
0.22/0.39	% (22945)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on E---3.1_22706 for (1799ds/183Mi)
0.22/0.39	% (22950)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on E---3.1_22706 for (1799ds/275Mi)
0.22/0.39	% (22951)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on E---3.1_22706 for (1799ds/18Mi)
0.22/0.39	% (22948)Instruction limit reached!
0.22/0.39	% (22948)------------------------------
0.22/0.39	% (22948)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.22/0.39	% (22948)Termination reason: Unknown
0.22/0.39	% (22948)Termination phase: Function definition elimination
0.22/0.39	
0.22/0.39	% (22948)Memory used [KB]: 895
0.22/0.39	% (22948)Time elapsed: 0.004 s
0.22/0.39	% (22948)Instructions burned: 2 (million)
0.22/0.39	% (22948)------------------------------
0.22/0.39	% (22948)------------------------------
0.22/0.39	% (22949)Instruction limit reached!
0.22/0.39	% (22949)------------------------------
0.22/0.39	% (22949)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.22/0.39	% (22949)Termination reason: Unknown
0.22/0.39	% (22949)Termination phase: Property scanning
0.22/0.39	
0.22/0.39	% (22949)Memory used [KB]: 1023
0.22/0.39	% (22949)Time elapsed: 0.004 s
0.22/0.39	% (22949)Instructions burned: 2 (million)
0.22/0.39	% (22949)------------------------------
0.22/0.39	% (22949)------------------------------
0.22/0.39	% (22950)Refutation not found, incomplete strategy
0.22/0.39	% (22950)------------------------------
0.22/0.39	% (22950)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.22/0.39	% (22950)Termination reason: Refutation not found, incomplete strategy
0.22/0.39	
0.22/0.39	
0.22/0.39	% (22950)Memory used [KB]: 5500
0.22/0.39	% (22950)Time elapsed: 0.005 s
0.22/0.39	% (22950)Instructions burned: 3 (million)
0.22/0.39	% (22946)Instruction limit reached!
0.22/0.39	% (22946)------------------------------
0.22/0.39	% (22946)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.22/0.39	% (22950)------------------------------
0.22/0.39	% (22950)------------------------------
0.22/0.39	% (22946)Termination reason: Unknown
0.22/0.39	% (22946)Termination phase: Saturation
0.22/0.39	
0.22/0.39	% (22946)Memory used [KB]: 5500
0.22/0.39	% (22946)Time elapsed: 0.005 s
0.22/0.39	% (22946)Instructions burned: 4 (million)
0.22/0.39	% (22946)------------------------------
0.22/0.39	% (22946)------------------------------
0.22/0.40	% (22945)First to succeed.
0.22/0.40	% (22947)Also succeeded, but the first one will report.
0.22/0.40	% (22945)Refutation found. Thanks to Tanya!
0.22/0.40	% SZS status Theorem for E---3.1_22706
0.22/0.40	% SZS output start Proof for E---3.1_22706
0.22/0.40	thf(func_def_0, type, in: $i > $i > $o).
0.22/0.40	thf(func_def_1, type, dsetconstr: $i > ($i > $o) > $i).
0.22/0.40	thf(func_def_4, type, binunion: $i > $i > $i).
0.22/0.40	thf(func_def_6, type, symdiff: $i > $i > $i).
0.22/0.40	thf(func_def_22, type, ph4: !>[X0: $tType]:(X0)).
0.22/0.40	thf(f64,plain,(
0.22/0.40	  $false),
0.22/0.40	  inference(trivial_inequality_removal,[],[f63])).
0.22/0.40	thf(f63,plain,(
0.22/0.40	  ($true = $false)),
0.22/0.40	  inference(superposition,[],[f23,f61])).
0.22/0.40	thf(f61,plain,(
0.22/0.40	  ((in @ sK0 @ sK2) = $false)),
0.22/0.40	  inference(trivial_inequality_removal,[],[f59])).
0.22/0.40	thf(f59,plain,(
0.22/0.40	  ($true = $false) | ((in @ sK0 @ sK2) = $false)),
0.22/0.40	  inference(superposition,[],[f38,f57])).
0.22/0.40	thf(f57,plain,(
0.22/0.40	  ((in @ sK0 @ (binunion @ sK2 @ sK1)) = $false)),
0.22/0.40	  inference(subsumption_resolution,[],[f55,f24])).
0.22/0.40	thf(f24,plain,(
0.22/0.40	  ($true != (in @ sK0 @ sK1))),
0.22/0.40	  inference(cnf_transformation,[],[f19])).
0.22/0.40	thf(f19,plain,(
0.22/0.40	  (($true != (in @ sK0 @ (symdiff @ sK2 @ sK1))) & ($true != (in @ sK0 @ sK1)) & ((in @ sK0 @ sK2) = $true)) & (binunionIL = $true) & (dsetconstrI = $true)),
0.22/0.40	  inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f17,f18])).
0.22/0.40	thf(f18,plain,(
0.22/0.40	  ? [X0,X1,X2] : (((in @ X0 @ (symdiff @ X2 @ X1)) != $true) & ((in @ X0 @ X1) != $true) & ((in @ X0 @ X2) = $true)) => (($true != (in @ sK0 @ (symdiff @ sK2 @ sK1))) & ($true != (in @ sK0 @ sK1)) & ((in @ sK0 @ sK2) = $true))),
0.22/0.40	  introduced(choice_axiom,[])).
0.22/0.40	thf(f17,plain,(
0.22/0.40	  ? [X0,X1,X2] : (((in @ X0 @ (symdiff @ X2 @ X1)) != $true) & ((in @ X0 @ X1) != $true) & ((in @ X0 @ X2) = $true)) & (binunionIL = $true) & (dsetconstrI = $true)),
0.22/0.40	  inference(flattening,[],[f16])).
0.22/0.40	thf(f16,plain,(
0.22/0.40	  (? [X0,X1,X2] : ((((in @ X0 @ (symdiff @ X2 @ X1)) != $true) & ((in @ X0 @ X1) != $true)) & ((in @ X0 @ X2) = $true)) & (binunionIL = $true)) & (dsetconstrI = $true)),
0.22/0.40	  inference(ennf_transformation,[],[f15])).
0.22/0.40	thf(f15,plain,(
0.22/0.40	  ~((dsetconstrI = $true) => ((binunionIL = $true) => ! [X0,X1,X2] : (((in @ X0 @ X2) = $true) => (((in @ X0 @ X1) != $true) => ((in @ X0 @ (symdiff @ X2 @ X1)) = $true)))))),
0.22/0.40	  inference(flattening,[],[f10])).
0.22/0.40	thf(f10,plain,(
0.22/0.40	  ~((dsetconstrI = $true) => ((binunionIL = $true) => ! [X0,X1,X2] : (((in @ X0 @ X2) = $true) => (~((in @ X0 @ X1) = $true) => ((in @ X0 @ (symdiff @ X2 @ X1)) = $true)))))),
0.22/0.40	  inference(fool_elimination,[],[f9])).
0.22/0.40	thf(f9,plain,(
0.22/0.40	  ~(dsetconstrI => (binunionIL => ! [X0,X1,X2] : ((in @ X0 @ X2) => (~(in @ X0 @ X1) => (in @ X0 @ (symdiff @ X2 @ X1))))))),
0.22/0.40	  inference(rectify,[],[f5])).
0.22/0.40	thf(f5,negated_conjecture,(
0.22/0.40	  ~(dsetconstrI => (binunionIL => ! [X2,X4,X0] : ((in @ X2 @ X0) => (~(in @ X2 @ X4) => (in @ X2 @ (symdiff @ X0 @ X4))))))),
0.22/0.40	  inference(negated_conjecture,[],[f4])).
0.22/0.40	thf(f4,conjecture,(
0.22/0.40	  dsetconstrI => (binunionIL => ! [X2,X4,X0] : ((in @ X2 @ X0) => (~(in @ X2 @ X4) => (in @ X2 @ (symdiff @ X0 @ X4)))))),
0.22/0.40	  file('/export/starexec/sandbox/tmp/tmp.2hQaHFxudp/E---3.1_22706.p',symdiffI1)).
0.22/0.40	thf(f55,plain,(
0.22/0.40	  ($true = (in @ sK0 @ sK1)) | ((in @ sK0 @ (binunion @ sK2 @ sK1)) = $false)),
0.22/0.40	  inference(not_proxy_clausification,[],[f54])).
0.22/0.40	thf(f54,plain,(
0.22/0.40	  ((~ (in @ sK0 @ sK1)) = $false) | ((in @ sK0 @ (binunion @ sK2 @ sK1)) = $false)),
0.22/0.40	  inference(binary_proxy_clausification,[],[f52])).
0.22/0.40	thf(f52,plain,(
0.22/0.40	  ((in @ sK0 @ (binunion @ sK2 @ sK1)) = $false) | (((~ (in @ sK0 @ sK1)) | (~ (in @ sK0 @ sK2))) = $false)),
0.22/0.40	  inference(beta_eta_normalization,[],[f51])).
0.22/0.40	thf(f51,plain,(
0.22/0.40	  ((in @ sK0 @ (binunion @ sK2 @ sK1)) = $false) | (((^[Y0 : $i]: ((~ (in @ Y0 @ sK1)) | (~ (in @ Y0 @ sK2)))) @ sK0) = $false)),
0.22/0.40	  inference(trivial_inequality_removal,[],[f50])).
0.22/0.40	thf(f50,plain,(
0.22/0.40	  ((in @ sK0 @ (binunion @ sK2 @ sK1)) = $false) | ($true != $true) | (((^[Y0 : $i]: ((~ (in @ Y0 @ sK1)) | (~ (in @ Y0 @ sK2)))) @ sK0) = $false)),
0.22/0.40	  inference(superposition,[],[f31,f47])).
0.22/0.40	thf(f47,plain,(
0.22/0.40	  ( ! [X2 : $i,X3 : $i,X1 : $i > $o] : (((in @ X2 @ (dsetconstr @ X3 @ X1)) = $true) | ((in @ X2 @ X3) = $false) | ((X1 @ X2) = $false)) )),
0.22/0.40	  inference(binary_proxy_clausification,[],[f46])).
0.22/0.40	thf(f46,plain,(
0.22/0.40	  ( ! [X2 : $i,X3 : $i,X1 : $i > $o] : (((in @ X2 @ X3) = $false) | ($true = ((X1 @ X2) => (in @ X2 @ (dsetconstr @ X3 @ X1))))) )),
0.22/0.40	  inference(binary_proxy_clausification,[],[f45])).
0.22/0.40	thf(f45,plain,(
0.22/0.40	  ( ! [X2 : $i,X3 : $i,X1 : $i > $o] : (($true = ((in @ X2 @ X3) => ((X1 @ X2) => (in @ X2 @ (dsetconstr @ X3 @ X1)))))) )),
0.22/0.40	  inference(beta_eta_normalization,[],[f44])).
0.22/0.40	thf(f44,plain,(
0.22/0.40	  ( ! [X2 : $i,X3 : $i,X1 : $i > $o] : (($true = ((^[Y0 : $i]: ((in @ X2 @ Y0) => ((X1 @ X2) => (in @ X2 @ (dsetconstr @ Y0 @ X1))))) @ X3))) )),
0.22/0.40	  inference(pi_clausification,[],[f43])).
0.22/0.40	thf(f43,plain,(
0.22/0.40	  ( ! [X2 : $i,X1 : $i > $o] : (($true = (!! @ $i @ (^[Y0 : $i]: ((in @ X2 @ Y0) => ((X1 @ X2) => (in @ X2 @ (dsetconstr @ Y0 @ X1)))))))) )),
0.22/0.40	  inference(beta_eta_normalization,[],[f42])).
0.22/0.40	thf(f42,plain,(
0.22/0.40	  ( ! [X2 : $i,X1 : $i > $o] : (($true = ((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ Y1) => ((X1 @ Y0) => (in @ Y0 @ (dsetconstr @ Y1 @ X1))))))) @ X2))) )),
0.22/0.40	  inference(pi_clausification,[],[f41])).
0.22/0.40	thf(f41,plain,(
0.22/0.40	  ( ! [X1 : $i > $o] : (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ Y0 @ Y1) => ((X1 @ Y0) => (in @ Y0 @ (dsetconstr @ Y1 @ X1)))))))) = $true)) )),
0.22/0.40	  inference(beta_eta_normalization,[],[f40])).
0.22/0.40	thf(f40,plain,(
0.22/0.40	  ( ! [X1 : $i > $o] : ((((^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y2) => ((Y0 @ Y1) => (in @ Y1 @ (dsetconstr @ Y2 @ Y0))))))))) @ X1) = $true)) )),
0.22/0.40	  inference(pi_clausification,[],[f39])).
0.22/0.40	thf(f39,plain,(
0.22/0.40	  ($true = (!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y2) => ((Y0 @ Y1) => (in @ Y1 @ (dsetconstr @ Y2 @ Y0)))))))))))),
0.22/0.40	  inference(beta_eta_normalization,[],[f30])).
0.22/0.40	thf(f30,plain,(
0.22/0.40	  ($true = (!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y2) => ((Y0 @ Y1) => (in @ Y1 @ (dsetconstr @ Y2 @ (^[Y3 : $i]: (Y0 @ Y3)))))))))))))),
0.22/0.40	  inference(definition_unfolding,[],[f27,f21])).
0.22/0.40	thf(f21,plain,(
0.22/0.40	  (dsetconstrI = $true)),
0.22/0.40	  inference(cnf_transformation,[],[f19])).
0.22/0.40	thf(f27,plain,(
0.22/0.40	  (dsetconstrI = (!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y2) => ((Y0 @ Y1) => (in @ Y1 @ (dsetconstr @ Y2 @ (^[Y3 : $i]: (Y0 @ Y3)))))))))))))),
0.22/0.40	  inference(cnf_transformation,[],[f14])).
0.22/0.40	thf(f14,plain,(
0.22/0.40	  (dsetconstrI = (!! @ ($i > $o) @ (^[Y0 : $i > $o]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y1 @ Y2) => ((Y0 @ Y1) => (in @ Y1 @ (dsetconstr @ Y2 @ (^[Y3 : $i]: (Y0 @ Y3)))))))))))))),
0.22/0.40	  inference(fool_elimination,[],[f13])).
0.22/0.40	thf(f13,plain,(
0.22/0.40	  (dsetconstrI = ! [X0,X1,X2 : $i > $o] : ((in @ X1 @ X0) => ((X2 @ X1) => (in @ X1 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X2 @ X3)))))))),
0.22/0.40	  inference(rectify,[],[f1])).
0.22/0.40	thf(f1,axiom,(
0.22/0.40	  (dsetconstrI = ! [X0,X2,X1 : $i > $o] : ((in @ X2 @ X0) => ((X1 @ X2) => (in @ X2 @ (dsetconstr @ X0 @ (^[X3 : $i] : (X1 @ X3)))))))),
0.22/0.40	  file('/export/starexec/sandbox/tmp/tmp.2hQaHFxudp/E---3.1_22706.p',dsetconstrI)).
0.22/0.40	thf(f31,plain,(
0.22/0.40	  ((in @ sK0 @ (dsetconstr @ (binunion @ sK2 @ sK1) @ (^[Y0 : $i]: ((~ (in @ Y0 @ sK1)) | (~ (in @ Y0 @ sK2)))))) != $true)),
0.22/0.40	  inference(beta_eta_normalization,[],[f28])).
0.22/0.40	thf(f28,plain,(
0.22/0.40	  ((in @ sK0 @ ((^[Y0 : $i]: ((^[Y1 : $i]: (dsetconstr @ (binunion @ Y0 @ Y1) @ (^[Y2 : $i]: ((~ (in @ Y2 @ Y1)) | (~ (in @ Y2 @ Y0)))))))) @ sK2 @ sK1)) != $true)),
0.22/0.40	  inference(definition_unfolding,[],[f25,f26])).
0.22/0.40	thf(f26,plain,(
0.22/0.40	  (symdiff = (^[Y0 : $i]: ((^[Y1 : $i]: (dsetconstr @ (binunion @ Y0 @ Y1) @ (^[Y2 : $i]: ((~ (in @ Y2 @ Y1)) | (~ (in @ Y2 @ Y0)))))))))),
0.22/0.40	  inference(cnf_transformation,[],[f8])).
0.22/0.40	thf(f8,plain,(
0.22/0.40	  (symdiff = (^[Y0 : $i]: ((^[Y1 : $i]: (dsetconstr @ (binunion @ Y0 @ Y1) @ (^[Y2 : $i]: ((~ (in @ Y2 @ Y1)) | (~ (in @ Y2 @ Y0)))))))))),
0.22/0.40	  inference(fool_elimination,[],[f7])).
0.22/0.40	thf(f7,plain,(
0.22/0.40	  ((^[X0 : $i, X1 : $i] : (dsetconstr @ (binunion @ X0 @ X1) @ (^[X2 : $i] : (~(in @ X2 @ X0) | ~(in @ X2 @ X1))))) = symdiff)),
0.22/0.40	  inference(rectify,[],[f3])).
0.22/0.40	thf(f3,axiom,(
0.22/0.40	  ((^[X0 : $i, X4 : $i] : (dsetconstr @ (binunion @ X0 @ X4) @ (^[X2 : $i] : (~(in @ X2 @ X0) | ~(in @ X2 @ X4))))) = symdiff)),
0.22/0.40	  file('/export/starexec/sandbox/tmp/tmp.2hQaHFxudp/E---3.1_22706.p',symdiff)).
0.22/0.40	thf(f25,plain,(
0.22/0.40	  ($true != (in @ sK0 @ (symdiff @ sK2 @ sK1)))),
0.22/0.40	  inference(cnf_transformation,[],[f19])).
0.22/0.40	thf(f38,plain,(
0.22/0.40	  ( ! [X2 : $i,X3 : $i,X1 : $i] : (($true = (in @ X1 @ (binunion @ X2 @ X3))) | ((in @ X1 @ X2) = $false)) )),
0.22/0.40	  inference(binary_proxy_clausification,[],[f37])).
0.22/0.40	thf(f37,plain,(
0.22/0.40	  ( ! [X2 : $i,X3 : $i,X1 : $i] : ((((in @ X1 @ X2) => (in @ X1 @ (binunion @ X2 @ X3))) = $true)) )),
0.22/0.40	  inference(beta_eta_normalization,[],[f36])).
0.22/0.40	thf(f36,plain,(
0.22/0.40	  ( ! [X2 : $i,X3 : $i,X1 : $i] : ((((^[Y0 : $i]: ((in @ X1 @ X2) => (in @ X1 @ (binunion @ X2 @ Y0)))) @ X3) = $true)) )),
0.22/0.40	  inference(pi_clausification,[],[f35])).
0.22/0.40	thf(f35,plain,(
0.22/0.40	  ( ! [X2 : $i,X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: ((in @ X1 @ X2) => (in @ X1 @ (binunion @ X2 @ Y0))))) = $true)) )),
0.22/0.40	  inference(beta_eta_normalization,[],[f34])).
0.22/0.40	thf(f34,plain,(
0.22/0.40	  ( ! [X2 : $i,X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ X1 @ Y0) => (in @ X1 @ (binunion @ Y0 @ Y1)))))) @ X2) = $true)) )),
0.22/0.40	  inference(pi_clausification,[],[f33])).
0.22/0.40	thf(f33,plain,(
0.22/0.40	  ( ! [X1 : $i] : (((!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: ((in @ X1 @ Y0) => (in @ X1 @ (binunion @ Y0 @ Y1))))))) = $true)) )),
0.22/0.40	  inference(beta_eta_normalization,[],[f32])).
0.22/0.40	thf(f32,plain,(
0.22/0.40	  ( ! [X1 : $i] : ((((^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y1) => (in @ Y0 @ (binunion @ Y1 @ Y2)))))))) @ X1) = $true)) )),
0.22/0.40	  inference(pi_clausification,[],[f29])).
0.22/0.40	thf(f29,plain,(
0.22/0.40	  ($true = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y1) => (in @ Y0 @ (binunion @ Y1 @ Y2))))))))))),
0.22/0.40	  inference(definition_unfolding,[],[f22,f20])).
0.22/0.40	thf(f20,plain,(
0.22/0.40	  (binunionIL = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y1) => (in @ Y0 @ (binunion @ Y1 @ Y2))))))))))),
0.22/0.40	  inference(cnf_transformation,[],[f12])).
0.22/0.40	thf(f12,plain,(
0.22/0.40	  (binunionIL = (!! @ $i @ (^[Y0 : $i]: (!! @ $i @ (^[Y1 : $i]: (!! @ $i @ (^[Y2 : $i]: ((in @ Y0 @ Y1) => (in @ Y0 @ (binunion @ Y1 @ Y2))))))))))),
0.22/0.40	  inference(fool_elimination,[],[f11])).
0.22/0.40	thf(f11,plain,(
0.22/0.40	  (! [X0,X1,X2] : ((in @ X2 @ X1) => (in @ X2 @ (binunion @ X1 @ X0))) = binunionIL)),
0.22/0.40	  inference(rectify,[],[f2])).
0.22/0.40	thf(f2,axiom,(
0.22/0.40	  (! [X4,X0,X2] : ((in @ X2 @ X0) => (in @ X2 @ (binunion @ X0 @ X4))) = binunionIL)),
0.22/0.40	  file('/export/starexec/sandbox/tmp/tmp.2hQaHFxudp/E---3.1_22706.p',binunionIL)).
0.22/0.40	thf(f22,plain,(
0.22/0.40	  (binunionIL = $true)),
0.22/0.40	  inference(cnf_transformation,[],[f19])).
0.22/0.40	thf(f23,plain,(
0.22/0.40	  ((in @ sK0 @ sK2) = $true)),
0.22/0.40	  inference(cnf_transformation,[],[f19])).
0.22/0.40	% SZS output end Proof for E---3.1_22706
0.22/0.40	% (22945)------------------------------
0.22/0.40	% (22945)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.22/0.40	% (22945)Termination reason: Refutation
0.22/0.40	
0.22/0.40	% (22945)Memory used [KB]: 5500
0.22/0.40	% (22945)Time elapsed: 0.008 s
0.22/0.40	% (22945)Instructions burned: 5 (million)
0.22/0.40	% (22945)------------------------------
0.22/0.40	% (22945)------------------------------
0.22/0.40	% (22944)Success in time 0.022 s
0.22/0.40	EOF